#include<bits/stdc++.h>
#define sd(n) scanf("%d",&n) 
#define sld(n) scanf("%lld",&n)
#define pd(n) printf("%d", (n))
#define pld(n) printf("%lld", n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
const int N=2e5;
#define INF 0x7fffffff
typedef long long int ll;
using namespace std;
//----------------------------------------------------------------------------//
int a[60];
int a2[60];
int as[60];
void solve()
{
	int n;
	sd(n);
	for(int i=1;i<=n;i++) sd(a[i]);

	sort(a+1,a+n+1,greater<int>());
	int head=1,ass=n,cur=1;
	while(head<=ass)
	{
		//swap(a[head],a[ass]);
		a2[cur]=a[head];cur++;
		a2[cur]=a[ass];cur++;
		head++;ass--;
	}
	for(int i=1;i<=n;i++) as[i]=as[i-1]+a2[i];

	for(int i=1;i<=n;i++)
	{
		if(as[i-1]==a2[i])
		{
			puts("NO");
			return;
		}
	}
	puts("YES");
	for(int i=1;i<=n;i++) cout<<a[i]<<" ";
	puts("");
}

int main()
{
	int T;
	sd(T);
	while (T--)
	{
		solve();
	}
	return 0;
}